0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n143.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:16:24 CST 2018
0.00/0.21	% done 7 iterations in 0.004s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(setminusI, axiom,
0.00/0.21	  (setminusI <=>
0.00/0.21	   (![A,B,Xx]: (in(Xx,A) => ((~in(Xx,B)) => in(Xx,setminus(A,B))))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ in(X0, X1) | in(X0, setminus(X1, X2)) | in(X0, X2) | ~ setminusI),
0.00/0.21	    inference('cnf', [status(esa)], [setminusI])).
0.00/0.21	tff(complementTE1, conjecture,
0.00/0.21	  (setminusI =>
0.00/0.21	   (![A,X]:
0.00/0.21	      (in(X,powerset(A)) =>
0.00/0.21	       (![Xx]: (in(Xx,A) => ((~in(Xx,setminus(A,X))) => in(Xx,X)))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (setminusI =>
0.00/0.21	     (![A,X]:
0.00/0.21	        (in(X,powerset(A)) =>
0.00/0.21	         (![Xx]: (in(Xx,A) => ((~in(Xx,setminus(A,X))) => in(Xx,X))))))))).
0.00/0.21	tff('1', plain, setminusI, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ in(X0, X1) | in(X0, setminus(X1, X2)) | in(X0, X2) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X0, X1, X2]: (in(X0, X2) | in(X0, setminus(X1, X2)) | ~ in(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff('4', plain, ~ in(sk_Xx1, setminus(sk_A1, sk_X)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('5', plain, (~ $true | ~ in(sk_Xx1, sk_A1) | in(sk_Xx1, sk_X)),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.21	tff('6', plain, in(sk_Xx1, sk_A1),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('7', plain, (~ $true | ~ $true | in(sk_Xx1, sk_X)),
0.00/0.21	    inference('demod', [status(thm)], ['5', '6'])).
0.00/0.21	tff('8', plain, in(sk_Xx1, sk_X), inference('simplify', [status(thm)], ['7'])).
0.00/0.21	tff('9', plain, ~ in(sk_Xx1, sk_X),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('10', plain, ~ $true, inference('sup-', [status(thm)], ['8', '9'])).
0.00/0.21	tff('11', plain, $false, inference('simplify', [status(thm)], ['10'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
